A new 2 - D and 3 - D thinning algorithm based on successive bordergenerationsVirginie
نویسندگان
چکیده
In this paper we present a skeletonization algorithm based on contour peeling. This algorithm can be applied on 2-D as well as on 3-D images. The 2-D algorithm is a new formulation of Pavlidis' algorithm, avoiding the explicit contour tracking, and is based on local computations only. The new thinning operator can be applied on all the image points in parallel. R esum e Dans ce papier nous pr esentons un algorithme de squelettisation bas e sur le suivi de contour. Cet algorithme peut ^ etre appliqu e sur des images 2-D et 3-D. L'algorithme 2-D est une reformulation de l'algorithme de Pavlidis qui evite un suivi de contour r eel, et qui est bas e sur des op erations locales. Ce nouvel op erateur d'amincissement peut egalement ^ etre appliqu e en parall ele sur tous les points d'une image.
منابع مشابه
A Thinning Method of Linear And Planar Array Antennas To Reduce SLL of Radiation Pattern By GWO And ICA Algorithms
In the recent years, the optimization techniques using evolutionary algorithms have been widely used to solve electromagnetic problems. These algorithms use thinning the antenna arrays with the aim of reducing the complexity and thus achieving the optimal solution and decreasing the side lobe level. To obtain the optimal solution, thinning is performed by removing some elements in an array thro...
متن کاملOptimal Nonlinear Energy Sinks in Vibration Mitigation of the Beams Traversed by Successive Moving Loads
Optimal Nonlinear Energy Sink (NES) is employed in vibration suppression of the beams subjected to successive moving loads in this paper. As a real application, a typical railway bridge is dynamically modeled by a single-span beam and a traveling high-speed train is simulated by a series of successive moving loads. Genetic algorithm is employed as the optimization technique and optimal paramete...
متن کاملSOME COMMENTS ON THINNING ALGORITHMS FOR 3 - D IMAGESFrancisco Nivando Bezerra
The problem of deening simple points in a two-dimensional binary image was extensively discussed in the literature. This deenition is more complicated for 3-d images due to the introduction of a new topological component, namely, the tunnel. Recently, some simple-point characterizations for these images have been proposed. In this paper we show the equivalences between these new characterizatio...
متن کاملSOME COMMENTS ON THINNING ALGORITHMS FOR 3 - D IMAGESFrancisco
The problem of deening simple points in a two-dimensional binary image was extensively discussed in the literature. This deenition is more complicated for 3-d images due to the introduction of a new topological component, namely, the tunnel. Recently, some simple-point characterizations for these images have been proposed. In this paper we show the equivalences between these new characterizatio...
متن کاملA Hybrid MOEA/D-TS for Solving Multi-Objective Problems
In many real-world applications, various optimization problems with conflicting objectives are very common. In this paper we employ Multi-Objective Evolutionary Algorithm based on Decomposition (MOEA/D), a newly developed method, beside Tabu Search (TS) accompaniment to achieve a new manner for solving multi-objective optimization problems (MOPs) with two or three conflicting objectives. This i...
متن کامل